全文获取类型
收费全文 | 4999篇 |
免费 | 396篇 |
国内免费 | 662篇 |
专业分类
林业 | 221篇 |
农学 | 483篇 |
基础科学 | 883篇 |
736篇 | |
综合类 | 2004篇 |
农作物 | 287篇 |
水产渔业 | 357篇 |
畜牧兽医 | 496篇 |
园艺 | 96篇 |
植物保护 | 494篇 |
出版年
2024年 | 32篇 |
2023年 | 178篇 |
2022年 | 271篇 |
2021年 | 294篇 |
2020年 | 265篇 |
2019年 | 273篇 |
2018年 | 218篇 |
2017年 | 263篇 |
2016年 | 283篇 |
2015年 | 249篇 |
2014年 | 272篇 |
2013年 | 271篇 |
2012年 | 324篇 |
2011年 | 344篇 |
2010年 | 281篇 |
2009年 | 235篇 |
2008年 | 240篇 |
2007年 | 291篇 |
2006年 | 260篇 |
2005年 | 198篇 |
2004年 | 152篇 |
2003年 | 126篇 |
2002年 | 116篇 |
2001年 | 96篇 |
2000年 | 72篇 |
1999年 | 58篇 |
1998年 | 65篇 |
1997年 | 37篇 |
1996年 | 43篇 |
1995年 | 44篇 |
1994年 | 27篇 |
1993年 | 28篇 |
1992年 | 32篇 |
1991年 | 25篇 |
1990年 | 22篇 |
1989年 | 18篇 |
1988年 | 18篇 |
1987年 | 6篇 |
1986年 | 6篇 |
1985年 | 6篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1963年 | 1篇 |
1956年 | 2篇 |
1955年 | 3篇 |
排序方式: 共有6057条查询结果,搜索用时 78 毫秒
71.
Chen Siqing Chen Tinghuai Zhou Liuding 《保鲜与加工》1992,(4):21-25
The rank one updating formula and the parallel eliminating algorithm for linear recurrence systems ane combined fo form a MTMD parallel algorithm fo solve tridiagonal Toeplitz Cinear equations. This algorithm has a simple strictire and requires onlty a few storages as well as in-terprocessor communications. There is no special demand on the number of processors in the parallel system. The speedup can come dose to p12 comparing with the LU decomposition method (p is the number of processors). It is worth pointing out that it is proposed algcmthn that considels and organizes the parallel arithmetic in the first order linear ricurrence systems with constant coefficients. 相似文献
72.
Hu Ning Chang Ruqing 《保鲜与加工》1991,(4):16-19
In this paper,a new algorithm for solving large-scale finite element system is presented, which utilizes the architecture of parallel processing. Firstly, the structure is partitioned into sub-regions. Then multi-fronts are used to assemble and eliminate concurrently in every sub-region. Thus the condensed interface stiffness matrices and load vectors are obtained. By serially assembling and solving global equation to get interface displacements and backing to every sub-region, the inter-nodal displacements and element stresses can be solved. The results of computation show that it can not only increase the speed of computation,but also save the memory space of computer effectively. This algorithm is an effective method for solving large-scale structural finite element systems. 相似文献
73.
Chen HuaZhou Jiaqi 《保鲜与加工》1990,(4):1-6
Based on the maximum flow principle about networks, a network flow approach to reliability evaluation in large scale netwerks ty mixing inereasing flow with decreasing flow is proposed in this paper.This approach gets the initial flow of each branch in a r.etwork associated with a state of the retwork by decreasing flows of some branches correlative to another state of the network.As a result, the number of flow compute required can be reduced enormously.The numerical example shows that the approach is powerful. The comparison of this approach with the minimal cutset one is also given in this paper. 相似文献
74.
75.
Tu Yaqing Huang Shanglian Li Zushu 《保鲜与加工》1993,(6):8-15
Based on the model of Human Simulation Intelligent Controller (HSIC)
presented briefly, a detailed algorithm was described for the servo system control by using the method of HSIC. Simulation results obtained proves the good performance of the control algorithm. 相似文献
76.
Zhou Liuding 《保鲜与加工》1991,(5):88-95
This paper proposes an intelligent method for solving a kind of intractable combinatorial problems, investigates and analyzes several important problems of this kind Theoretical and experimental results show that this method is better than the classical backtracking method. 相似文献
77.
Distribution Network Structure planning is a complex combinatorial optimization problem,which is difficult to solve properly by using traditional optimization methods.In order to solve this problem,Improved Immune Genetic Algorithm is introduced to the distribution network optimal planning. Improved Immune Genetic Algorithm draws into the immune diversity and antibody's density mechanism to maintain the individual's diversity and remains evolution algorithm's global stochastic searching ability,so it can promote diversity and the whole optimal-searching ability of genetic algorithm.The optimal module takes the minimum annual cost as its object,and the capacity and voltage drop of feeder and the radiation of distribution network as its restrictions.According to the require of radiation of distribution network,the spanning tree of the alternative network is taken as the initial solution to speed up the calculation.And the branch-exchange method is used in designing crossover operator and mutation operator to avoid the radiation checking and enhance the optimizing ability.This algorithm has been illustrated effectively by examples,at the same time,the calculation example demonstrates that,the algorithm has higher calculation speed than the traditional immune genetic algorithm. 相似文献
78.
79.
Zeag Yongning Tong Fu 《保鲜与加工》1989,(2):43-49
An optimization approach for multi-relational joins based on
the matching concept in graph theory is introduced. The basic idea lies in constructing a join graph from an expression of N-relation query, and seeking for a maximun matching with minimun total weight. The algorithm for bipartition(X, Y) is proposed in this paper. 相似文献
80.
Yang Xiutai Nie Duan 《保鲜与加工》1993,(4):6-10
This paper discusses the problem of long-range generation expansion planning. A dynamic model for long-range expansion planning is set up and an algorithm-a two-step programming is presented, which is used here in a case. 相似文献